A Hybrid Evolutionary Approach to the Nurse Rostering Problem
نویسندگان
چکیده
منابع مشابه
A Hybrid Tabu Search Algorithm for the Nurse Rostering Problem
This paper deals with the problem of nurse rostering in Belgian hospitals. This is a highly constrained real world problem that was (until the results of this research were applied) tackled manually. The problem basically concerns the assignment of duties to a set of people with different qualifications, work regulations and preferences. Constraint programming and linear programming techniques ...
متن کاملA Constraint Programming and Hybrid Approach to Nurse Rostering Problems
This paper describes a decision support methodologies for nurse rostering problem in a modern hospital environment. In particular, it is very important to efficiently utilise time and effort, to evenly balance the workload among people and to attempt to satisfy personnel preference. We presented a complete model to formulate all the complex real-world constraints, solution approach and Hybrid a...
متن کاملA systematic two phase approach for the nurse rostering problem
Nurse Rostering is a combinatorial problem hard to solve due to its size and complexity. Several real world details that arise in practice make computerized approaches to the problem indispensable. The specifications of the problem that we solve are those defined in the Nurse Rostering Competition INRC2010. In this contribution, we solve the Nurse Rostering Problem by partitioning the original ...
متن کاملSolving a nurse rostering problem considering nurses preferences by graph theory approach
Nurse Rostering Problem (NRP) or the Nurse Scheduling Problem (NSP) is a complex scheduling problem that affects hospital personnel on a daily basis all over the world and is known to be NP-hard.The problem is to decide which members of a team of nurses should be on duty at any time, during a rostering period of, typically, one month.It is very important to efficiently utilize time and effort, ...
متن کاملA Tensor-based Approach to Nurse Rostering
Hyper-heuristics are high level improvement search methodologies exploring space of heuristics [4]. According to [5], hyper-heuristics can be categorized in many ways. A hyper-heuristic either selects from a set of available low level heuristics or generates new heuristics from components of existing low level heuristics to solve a problem, leading to a distinction between selection and generat...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Evolutionary Computation
سال: 2010
ISSN: 1089-778X,1941-0026
DOI: 10.1109/tevc.2009.2033583